RSSM: A Rough Sets based Service Matchmaking Algorithm
نویسندگان
چکیده
The past few years have seen the Grid is evolving as a service-oriented computing infrastructure. It is envisioned that various resources in a future Grid environment will be exposed as services. Service discovery becomes an issue of vital importance for utilising Grid facilities. This paper presents RSSM, a Rough Sets based service matchmaking algorithm for service discovery that can deal with uncertainty of service properties when matching service advertisements with service requests. The evaluation results show that the RSSM algorithm is more effective in service discovery compared with other mechanisms such as UDDI and OWL-S.
منابع مشابه
A novel non-functional matchmaking approach between fuzzy user queries and real world web services based on rough sets
We propose in this paper a novel matchmaking approach between fuzzy user queries and real world Web services. The matchmaking spans over a domain dependent classification step that produces fuzzy classification rules for Web services. The elaborated rules leverage a core set of non-functional quality attributes, which is extracted using rough sets theory. Furthermore, these rules are leveraged ...
متن کاملA hybrid filter-based feature selection method via hesitant fuzzy and rough sets concepts
High dimensional microarray datasets are difficult to classify since they have many features with small number ofinstances and imbalanced distribution of classes. This paper proposes a filter-based feature selection method to improvethe classification performance of microarray datasets by selecting the significant features. Combining the concepts ofrough sets, weighted rough set, fuzzy rough se...
متن کاملResource Matchmaking Algorithm using Dynamic Rough Set in Grid Environment
Grid environment is a service oriented infrastructure in which many heterogeneous resources participate to provide the high performance computation. One of the bug issues in the grid environment is the vagueness and uncertainty between advertised resources and requested resources. Furthermore, in an environment such as grid dynamicity is considered as a crucial issue which must be dealt with. C...
متن کاملAgent service matchmaking algorithm for autonomic element with semantic and QoS constraints
Agent service description and matchmaking problem for autonomic element has been taken as one of the most important issue in the field of autonomic computing based on agent and multi-agent system. Considering the semantic and QoS for capability description of agent service are two important issues during matchmaking, the factors of semantic and QoS during matchmaking are considered together, an...
متن کاملDiagnosis of the disease using an ant colony gene selection method based on information gain ratio using fuzzy rough sets
With the advancement of metagenome data mining science has become focused on microarrays. Microarrays are datasets with a large number of genes that are usually irrelevant to the output class; hence, the process of gene selection or feature selection is essential. So, it follows that you can remove redundant genes and increase the speed and accuracy of classification. After applying the gene se...
متن کامل